Fault-Tolerant Broadcasts

A Modular Approach to Fault-tolerant Broadcasts and Related Problems

On the Impact of Fast Failure Detectors on Real-Time Fault-Tolerant Systems

We investigate whether fast failure detectors can be useful — and if so by how much — in the design of real-time fault-tolerant systems. Specifically, we show how fast failure detectors can speed up consensus and fault-tolerant broadcasts, by providing fast algorithms and deriving some matching lower bounds, for synchronous systems with crashes. These results show that a fast failure detector s...

Fault-Tolerant Broadcasts in CAN

Fault-tolerant distributed systems based on eld-buses may take advantage from reliable and atomic broadcast. There is a current belief that CAN native mechanisms provide atomic broadcast. In this paper, we dismiss this misconception, explaining how network errors may lead to: inconsistent message delivery; generation of message duplicates. These errors may occur when faults hit the last two bit...

Total order broadcast for fault tolerant exascale systems

In the process of designing a new fault tolerant run-time for future exascale systems, we discovered that a total order broadcast would be necessary. That is, nodes of a supercomputer should be able to broadcast messages to other nodes even in the face of failures. All messages should be seen in the same order at all nodes. While this is a well studied problem in distributed systems, few resear...

Probabilistic Bounds on Message Delivery for the Totem Single-Ring Protocol

For fault-tolerant real-time distributed systems, the probability that a message is not delivered within its real-time deadline must be small enough that it does not adversely aaect system reliability. We investigate the delivery of messages for the Totem Protocol, a reliable ordered broadcast protocol that we have developed for fault-tolerant distributed systems with physical broadcasts over a...